Iterated Random Walk
نویسنده
چکیده
– The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using the method of moments. When the number of iterations n → ∞, a time-independent asymptotic density is obtained. It has a simple symmetric exponential form which is stable against the modification of a finite number of iterations. When n is large, the deviation from the stationary density is exponentially small in n. The continuum results are compared to Monte Carlo data for the discrete iterated random walk. Introduction. – When a walker moves at random along a straight support, its typical displacement at time t grows like l ∼ t 1/2. If the support of the walk is itself a random walk (RW), at time t the walker is typically located at the lth step of the walk on which it is moving. Thus the mean-square displacement of the walker behaves as X 2 (t) ∼ l ∼ t 1/2 and his actual typical displacement is reduced, growing as t 1/4 instead of t 1/2 for the conventional RW. This model of a RW on a RW has been studied for a one-dimensional support [1] and also in higher dimensions [2,3]. It has been used to discuss the diffusion of the stored length along a polymer chain entangled in a network [4, 5, 6] and the Brownian motion of charged particles in a turbulent plasma [7]. In this latter case, the particles are constrained to diffuse along the random magnetic field lines in the limit B → ∞. In this work we study the properties of the one-dimensional iterated random walk (IRW), i.e., the RW on a RW which is itself a RW on a RW, and so on. The first three steps of this iteration process are shown in fig. 1. Working in the continuum (Gaussian) limit, we first study the moments X p (t) of the probability density P (n) (X, t) to find the walker at (X, t) after the nth iteration. In the next section, we examine the limit n → ∞ for which the asymptotic probability density P (∞) (X, t) can be obtained explicitly. We also look at the way this asymptotic density is approached when n is large. Then the continuum …
منابع مشابه
Law of the iterated logarithm for oscillating random walks conditioned to stay non-negative
We show that under a 3+ δ moment condition (where δ > 0) there exists a ‘Hartman-Winter’ Law of the Iterated Logarithm for random walks conditioned to stay non-negative. We also show that under a second moment assumption the conditioned random walk eventually grows faster than n (logn) for any ε > 0 and yet slower than n (logn) . The results are proved using three key facts about conditioned ra...
متن کاملModerate deviations for the range of planar random walks
Given a symmetric random walk in Z2 with finite second moments, let Rn be the range of the random walk up to time n. We study moderate deviations for Rn −ERn and ERn−Rn. We also derive the corresponding laws of the iterated logarithm.
متن کاملStrong limit theorems for a simple random walk on the 2-dimensional comb
We study the path behaviour of a simple random walk on the 2-dimensional comb lattice C2 that is obtained from Z2 by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation result for such a random walk which, in turn, enables us to establish strong limit theorems, like the joint Strassen type law of the iterated logarithm of its two components, as well as t...
متن کاملLarge Favourite Sites of Simple Random Walk and the Wiener Process Large Favourite Sites of Simple Random Walk and the Wiener Process
Let U (n) denote the most visited point by a simple symmetric random walk fS k g k0 in the rst n steps. It is known that U (n) and max 0kn S k satisfy the same law of the iterated logarithm, but have diierent upper functions (in the sense of P. L evy). The distance between them however turns out to be transient. In this paper, we establish the exact rate of escape of this distance. The correspo...
متن کاملTransient Nn Random Walk on the Line
We prove strong theorems for the local time at in nity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over which the walk runs through (always from left to right) without ever returning. AMS 2000 Subject Classi cation: Primary 60G50; Secondary 60F15, 60J55.
متن کامل